Optimality Conditions for Minimizers at Infinity in Polynomial Programming
نویسندگان
چکیده
منابع مشابه
Optimality Conditions for Minimizers at Infinity in Polynomial Programming
In this paper we study necessary optimality conditions for the optimization problem infimumf0(x) subject to x ∈ S, where f0 : R → R is a polynomial function and S ⊂ R is a set defined by polynomial inequalities. Assume that the problem is bounded below and has the Mangasarian– Fromovitz property at infinity. We first show that if the problem does not have an optimal solution, then a version at ...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملRelative Pareto minimizers for multiobjective problems: existence and optimality conditions
In this paper we introduce and study enhanced notions of relative Pareto minimizers to constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency /minimality. Using advanced tools of variational analysis and generalized differentiation, we esta...
متن کاملUnfolding Polynomial Maps at Infinity
Let f : Cn → C be a polynomial map. The polynomial describes a family of complex affine hypersurfaces f−1(c), c ∈ C. The family is locally trivial, so the hypersurfaces have constant topology, except at finitely many irregular fibers f−1(c) whose topology may differ from the generic or regular fiber of f . We would like to give a full description of the topology of this family in terms of easil...
متن کاملNecessary Optimality Conditions in Pessimistic Bilevel Programming Necessary Optimality Conditions in Pessimistic Bilevel Programming
This paper is devoted to the so-called pessimistic version of bilevel programming programs. Minimization problems of this type are challenging to handle partly because the corresponding value functions are often merely upper (while not lower) semicontinuous. Employing advanced tools of variational analysis and generalized differentiation, we provide rather general frameworks ensuring the Lipsch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2019
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2018.0974